#include <cstdint>
#include <map>
#include <set>
#include <unordered_map>
#include<vector>
using namespace std;

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int, int> m;
        for(int i=0;i<nums.size();i++){
            if(auto p = m.find(target-nums[i]);p!=m.end()){
                return {p->second,i};
            }
            m.insert({nums[i],i});
        }
        return {0,0};
    }
};
int main(){
    
}